Stability and Performance of Stack Algorithms for Random Access Communication Modeled as a Tree Structured Qbd Markov Chain
نویسندگان
چکیده
منابع مشابه
Throughput of Q-ary Splitting Algorithms for Contention Resolution in Communication Networks∗
The throughput characteristics of contention-based random access channels which use Q-ary splitting algorithms (where Q is the number of groups into which colliding users are split) are analyzed. The algorithms considered are of the Capetanakis-Tsybakov-Mikhailov-Vvedenskaya (CTMV) type and are studied for infinite populations of identical users generating packets according to a discrete time b...
متن کاملTree Structured Qbd Markov Chains and Tree-like Qbd Processes
In this paper we show that an arbitrary tree structured QBD Markov chain can be embedded in a tree-like QBD process with a special structure. Moreover, we present an algebraic proof that applying the natural fixed point iteration (FPI) to the nonlinear matrix equation V = B + ∑d s=1 Us(I − V )Ds that solves the tree-like QBD process, is equivalent to the more complicated iterative algorithm pre...
متن کاملExplorer Quasi - Birth - Death Processes , Tree - Like QBDs , Probabilistic 1 - Counter Automata , and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and both Tree-Like QBDs (TLQBDs) and Tree-Structured QBDs (TS-QBDs) are equivalent to both probabilistic Pushdown Systems (pPDSs) and Recursive Markov Chains (RMCs). We then proceed to exploit these connections to obtain a ...
متن کاملOn the Generality of Binary Tree-like Markov Chains
In this paper we show that an arbitrary tree-like Markov chain can be embedded in a binary tree-like Markov chain with a special structure. When combined with [7], this implies that any tree structured QBD Markov chain can be reduced to a binary tree-like process. Furthermore, a simple relationship between the V , Rs and Gs matrices of the original and the binary tree-like Markov chain is estab...
متن کاملFinancial Risk Modeling with Markova Chain
Investors use different approaches to select optimal portfolio. so, Optimal investment choices according to return can be interpreted in different models. The traditional approach to allocate portfolio selection called a mean - variance explains. Another approach is Markov chain. Markov chain is a random process without memory. This means that the conditional probability distribution of the nex...
متن کامل